Polynomial spaces over finite fields
نویسندگان
چکیده
منابع مشابه
Linearized polynomial maps over finite fields
We consider polynomial maps described by so-called (multivariate) linearized polynomials. These polynomials are defined using a fixed prime power, say q. Linearized polynomials have no mixed terms. Considering invertible polynomial maps without mixed terms over a characteristic zero field, we will only obtain (up to a linear transformation of the variables) triangular maps, which are the most b...
متن کاملOn Sparse Polynomial Interpolation over Finite Fields
We present a Las Vegas algorithm for interpolating a sparse multivariate polynomial over a finite field, represented with a black box. Our algorithm modifies the algorithm of BenOr and Tiwari in 1988 for interpolating polynomials over rings with characteristic zero to characteristic p by doing additional probes. One of the best algorithms for sparse polynomial interpolation over a finite field ...
متن کاملUnivariate Polynomial Factorization Over Finite Fields
This paper shows that a recently proposed approach of D. Q. Wan to bivariate factorization over finite fields, the univariate factoring algorithm of V. Shoup, and the new bound of this paper for the average number of irreducible divisors of polynomials of a given degree over a finite field can be used to design a bivariate factoring algorithm that is polynomial for "almost all" bivariate polyno...
متن کاملRandom Krylov Spaces over Finite Fields
Motivated by a connection with block iterative methods for solving linear systems over finite fields, we consider the probability that the Krylov space generated by a fixed linear mapping and a random set of elements in a vector space over a finite field equals the space itself. We obtain an exact formula for this probability, and from it we derive good lower bounds that approach 1 exponentiall...
متن کاملClassical Wavelet Transforms over Finite Fields
This article introduces a systematic study for computational aspects of classical wavelet transforms over finite fields using tools from computational harmonic analysis and also theoretical linear algebra. We present a concrete formulation for the Frobenius norm of the classical wavelet transforms over finite fields. It is shown that each vector defined over a finite field can be represented as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 1999
ISSN: 0024-3795
DOI: 10.1016/s0024-3795(99)00102-0